Enhanced Multi-View Subspace Clustering via Twist Tensor Nuclear Norm and Constraint Propagation
نویسندگان
چکیده
Multi-view subspace clustering (MVSC) can effectively group multi-view data distributed around several low-dimensional subspaces. Although encouraging results, most existing methods suffer from two typical limitations, resulting in performance degradation. They ignore high-order correlations underlying the data, leading to degeneration of complementary power; addition, they rely on much prior knowledge (e.g., pairwise constraints) for enhancement. In this paper, a novel algorithm called Enhanced Subspace Clustering (EMVSC) is proposed address both limitations. EMVSC exploit and optimally use limited better performance. Specifically, imposes twist tensor nuclear norm representation constructed by stacking view-specific self-representations; exploits constraints whole dataset employing constraint propagation, which propagates constrained samples unconstrained samples. To efficiently optimize EMVSC, an extended intact augmented Lagrangian method derived with good convergence. Experimental results seven standard databases demonstrate its efficacy.
منابع مشابه
Multi-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank
In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...
متن کاملMulti-view clustering via pairwise sparse subspace representation
Multi-view clustering, which aims to cluster datasets with multiple sources of information, has a wide range of applications in the communities of data mining and pattern recognition. Generally, it makes use of the complementary information embedded in multiple views to improve clustering performance. Recent methods usually find a low-dimensional embedding of multi-view data, but often ignore s...
متن کاملNuclear Norm Minimization via Active Subspace Selection
We describe a novel approach to optimizing matrix problems involving nuclear norm regularization and apply it to the matrix completion problem. We combine methods from non-smooth and smooth optimization. At each step we use the proximal gradient to select an active subspace. We then find a smooth, convex relaxation of the smaller subspace problems and solve these using second order methods. We ...
متن کاملOn Tensor Completion via Nuclear Norm Minimization
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors into matrices and then apply techniques for matrix completion. We show here th...
متن کاملRobust Localized Multi-view Subspace Clustering
In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of realworld applications, the confidence levels of samples in the same viewmay also vary. Thus considering a unified weight for a view may lead to suboptim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3274837